#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>

using namespace std;

bool isInterleave(string s1, string s2, string s3) {
    int m = s1.size();
    int n = s2.size();

    s1 = " " + s1;
    s2 = " " + s2;
    s3 = " " + s3;

    vector<vector<bool >> dp(m + 1, vector<bool>(n + 1));
    dp[0][0] = true;

    for (int i = 1; i <= m; ++i)
        if (s1[i] == s3[i])
            dp[i][0] = true;
        else
            break;

    for (int j = 1; j <= n; ++j)
        if (s2[j] == s3[j])
            dp[0][j] = true;
        else
            break;

    for (int i = 1; i <= m; ++i)
    {
        for (int j = 1; j <= n; ++j)
        {
            if (s1[i] == s3[i + j])
                dp[i][j] = dp[i][j] || dp[i - 1][j];
            if (s2[j] == s3[i + j])
                dp[i][j] = dp[i][j] || dp[i][j - 1];
            if (s1[i] != s3[i + j] && s2[j] != s3[i + j])
                dp[i][j] = dp[i - 1][j - 1];
        }
    }

    return dp[m][n];
}

int minimumDeleteSum(string s1, string s2) {
    int m = s1.size();
    int n = s2.size();

    int sum = 0;
    for (auto c : s1)
        sum += c;
    for (auto c : s2)
        sum += c;

    vector<vector<int>> dp(m + 1, vector<int>(n + 1, 0));

    for (int i = 1; i <= m; ++i)
    {
        for (int j = 1; j <= n; ++j)
        {
            if (s1[i - 1] == s2[j - 1])
                dp[i][j] = max(dp[i - 1][j - 1] + s1[i - 1], dp[i][j]);
            dp[i][j] = max(dp[i][j], max(dp[i - 1][j], dp[i][j - 1]));
        }
    }

    return sum - dp[m][n] - dp[m][n];
}

int main()
{
    isInterleave("", "", "a");
	return 0;
}